منابع مشابه
On the Difficulty of Triangulating Three-Dimensional Nonconvex Polyhedra
A number of different polyhedral decomposition problems have previously been studied, most notably the problem of triangulating a simple polygon. We are concerned with the polyhedron triangulation problem: decomposing a three-dimensional polyhedron into a set of nonoverlapping tetrahedra whose vertices must be vertices of the polyhedron. It has previously been shown that some polyhedra cannot b...
متن کاملTriangulating a Plane
In this theoretical paper we consider the problem of accurately triangulating a scene plane. Rather than first triangulating a set of points and then fitting a plane to these points, we try to minimize the back-projection errors as functions of the plane parameters directly. As this is both geometrically and statistically meaningful our method performs better than the standard two step procedur...
متن کاملTriangulating a Polygon in Parallel
In this paper we present a.n efficient pa.ra.Ilel algorithm. for polygon tria.ngu.Ia.tion. The algo-rithm we present runs in O(logn) time using D(n) processors, which is optimal if the polygon is allowed to contain holes. This improves the previous parallel complexity bounds for this problem by a log n factor. If we are also given a trapezoidal decomposition of the polygon as input, then we can...
متن کاملTriangulating stable laminations
We study the asymptotic behavior of random simply generated noncrossing planar trees in the space of compact subsets of the unit disk, equipped with the Hausdorff distance. Their distributional limits are obtained by triangulating at random the faces of stable laminations, which are random compact subsets of the unit disk made of non-intersecting chords coded by stable Lévy processes. We also s...
متن کاملTriangulating the Real Projective Plane
We consider the problem of computing a triangulation of the real projective plane P , given a finite point set P = {p1, p2, . . . , pn} as input. We prove that a triangulation of P always exists if at least six points in P are in general position, i.e., no three of them are collinear. We also design an algorithm for triangulating P if this necessary condition holds. As far as we know, this is t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 1990
ISSN: 0179-5376,1432-0444
DOI: 10.1007/bf02187807